Automatic Derivation of Compositional Rules in Automated Compositional Reasoning
نویسنده
چکیده
Soundness of compositional reasoning rules depends on computational models and sometimes is rather involved. Since it is tedious to establish new rules, verifiers are forced to mould verification problems into a handful of proof rules available to them. In this paper, a syntactic approach to establishing soundness of proof rules in automated compositional reasoning is shown. Not only can our work justify all proof rules known to us automatically, but also derive new circular rules by intuitionistic reasoning without human intervention. Practitioners can now develop their own rules in automated compositional reasoning through learning rather easily.
منابع مشابه
A Survey on Compositional Veri cation
In this survey, we overview several compositional veriication approaches based on model checking, namely compositional minimization, classic assume guarantee reasoning and circular reasoning. We describe details of each of these approaches, and elaborate the general problems with some proposed solutions. We also summarize the advantages and disadvantages of each. In the last section, we give a ...
متن کاملAutomatic symbolic compositional verification by learning assumptions
Compositional reasoning aims to improve scalability of verification tools by reducing the original verification task into subproblems. The simplification is typically based on assume-guarantee reasoning principles, and requires user guidance to identify appropriate assumptions for components. In this paper, we propose a fully automated approach to compositional reasoning that consists of automa...
متن کاملAbstraction and Assume-guarantee Reasoning for Automated Software Verification
ion and Assume-guarantee Reasoning for Automated Software Verification S. Chaki, E. Clarke, D. Giannakopoulou, and C.S. Păsăreanu 1 Carnegie Mellon Software Engineering Institute 2 Carnegie Mellon University 3 RIACS, NASA Ames Research Center, Moffett Field, CA, USA 4 Kestrel Technology LLC, NASA Ames Research Center, Moffett Field, CA, USA Abstract. Compositional verification and abstraction a...
متن کاملProof Rules for Automated Compositional Verification through Learning
Compositional proof systems not only enable the stepwise development of concurrent processes but also provide a basis to alleviate the state explosion problem associated with model checking. An assume-guarantee style of specification and reasoning has long been advocated to achieve compositionality. However, this style of reasoning is often nontrivial, typically requiring human input to determi...
متن کاملCompositional probabilistic verification through multi-objective model checking
Compositional approaches to verification offer a powerful means to address the challenge of scalability. In this paper, we develop techniques for compositional verification of probabilistic systems based on the assume-guarantee paradigm. We target systems that exhibit both nondeterministic and stochastic behaviour, modelled as probabilistic automata, and augment these models with costs or rewar...
متن کامل